Connectivity and giant component of stochastic Kronecker graphs
نویسندگان
چکیده
منابع مشابه
Connectivity and Giant Component of Stochastic Kronecker Graphs
Stochastic Kronecker graphs are a model for complex networks where each edge is present independently according the Kronecker (tensor) product of a fixed matrix P ∈ [0, 1]k×k. We develop a novel correspondence between the adjacencies in a general stochastic Kronecker graph and the action of a fixed Markov chain. Using this correspondence we are able to generalize the arguments of Horn and Radcl...
متن کاملStochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This model simultaneously captures several well-known properties of real-world networks; in particular, it gives rise to a heavy-tailed degree distribution, has a low diameter, and obeys the densification power law. Most p...
متن کاملGiant components in Kronecker graphs
Let n ∈ N, 0 < α, β, γ < 1. Define the random Kronecker graph K(n, α, γ, β) to be the graph with vertex set Z2 , where the probability that u is adjacent to v is given by pu,v = α u·vγ(1−u)·(1−v)βn−u·v−(1−u)·(1−v). This model has been shown to obey several useful properties of real-world networks. We establish the asymptotic size of the giant component in the random Kronecker graph.
متن کاملGiant Component and Connectivity in Geographical Threshold Graphs
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We study this model and give conditions for the absence and existence of the giant component, as well as for connectivity.
متن کاملHuman Activities as Stochastic Kronecker Graphs
A human activity can be viewed as a space-time repetition of activity primitives. Both instances of the primitives, and their repetition are stochastic. They can be modeled by a generative model-graph, where nodes correspond to the primitives, and the graph’s adjacency matrix encodes their affinities for probabilistic grouping into observable video features. When a video of the activity is repr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2015
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2015.v6.n4.a4